Vehicle Path Planning Based on Gradient Statistical Mutation Quantum Genetic Algorithm
نویسندگان
چکیده
In the field of vehicle path planning, traditional intelligent optimization algorithms have disadvantages slow convergence, poor stability and a tendency to fall into local extremes. Therefore, gradient statistical mutation quantum genetic algorithm (GSM-QGA) is proposed. Based on dynamic rotation angle adjustment by chromosome fitness value, gate strategy improved introducing idea descent. According properties chromosomal change trends, gradient-based operator designed realize operation. The shortest used as metric build planning model, effectiveness modified in demonstrated simulation experiments. Compared with other algorithms, length planned shorter search better. can be effectively controlled optimums.
منابع مشابه
Route Planning Based on Gradient-Field Quantum Genetic Algorithm Model
A route planning method based on gradient-field quantum genetic algorithm model was presented in this paper. It introduces the gradient field of a grid map to quantum genetic algorithm model and uses quantum genetic algorithm (QGA) to optimize the cost function of route planning. By combining the quantum characteristics with the capabilities of the large diversity of the population, as well as ...
متن کاملUnmanned Aerial Vehicle Path Planning Based on Tlbo Algorithm
Path planning of unmanned aerial vehicle (UAV) is an optimal problem in the complex combat field environment. Teaching-Learning-Based Optimization (TLBO) algorithm is presented under the inspiration of the teaching-learning behavior in a classroom. In this paper, this algorithm is applied to design a path by the search angle and distance, by which a better path at higher convergence speed and s...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملMobile Robot Dynamic Path Planning Based on Genetic Algorithm
In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...
متن کاملRobot Path Planning Method Based on Improved Genetic Algorithm
This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2023
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2023.0140664